A comparison of fixed-priority and static cyclic scheduling for distributed automotive control applications

نویسندگان

  • Henrik Lönn
  • Jakob Axelsson
چکیده

This paper compares different scheduling policies applied to distributed systems intended for automotive real-time control applications. We describe the characteristics of systems using fixed priority (FP) and static cyclic (SC) scheduling of processors and bus communication, with combinations ranging from FP bus-FP processors to SC bus-SC processors. FP bus is represented by the Controller Area Network protocol (CAN) and SC bus by a Time Division Multiple Access (TDMA) protocol. We also study the effects of using a global time base. Our main concern is control performance, including input and output jitter and control delay and therefore the response time of a sequence of control tasks and the related communication. For each system configuration we analyze the expected response times of a series of control related tasks (delay) and the temporal variation of the input and output instants (jitter).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tool support for the construction of statically analysable hard real-time Ada systems

This paper maintains that fixed-priority process-based preemptive scheduling is, arguably, more convenient, flexible and responsive than conventional cyclic scheduling for the construction of new-generation software-intensive satellite control systems. Predictable usage of preemptive priority-based scheduling, however, demands the support of mature static analysis techniques. Worst-case respons...

متن کامل

Analysis and Optimization of Mixed-criticality Applications on Partitioned Distributed Architectures

In this paper we are interested in mixed-criticality applications implemented using distributed heterogenous architectures, composed of processing elements (PEs) interconnected using the TTEthernet protocol. At the PE-level, we use partitioning, such that each application is allowed to run only within predefined time slots, allocated on each processor. At the communication-level, TTEthernet use...

متن کامل

Using Fixed Priority Pre-emptive Scheduling in Real-Time Systems

For real-time applications, task scheduling is a problem of paramount importance. Several scheduling algorithms were proposed in the literature, starting from static scheduling or cyclic executives which provide very deterministic yet inflexible behaviour, to the so called best-effort scheduling, which facilitates maximum run-time flexibility but allows only probabilistic predictions of run-tim...

متن کامل

Scheduling Distributed Real-Time Tasks in the DGMF Model

Analytical results on the real-time scheduling of multiprocessor systems have focussed on partitioning and distributing the task set for scheduling on identical single processors, with the assumption that all of a task can be executed on any of a pool of identical processors. A distributed system is a set of nodes networked together. Each node may have a different type of processor and performs...

متن کامل

Modeling of Ethernet AVB Networks for Worst-Case Timing Analysis

Ethernet is currently explored as the upcoming network standard for distributed control applications in many different industries such as automotive, avionics and industrial automation. It offers higher performance and flexibility over traditional control bus systems such as CAN and ProfiBus. For distributed control applications, predictable communication timing is highly important which can be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999